Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
arxiv.org·17h
🕸️Network Topology
How Many Paths of Length K Are There Between a and B?
horace.io·1d·
Discuss: Hacker News
🕸️Graph Algorithms
FLINT: Fast Library for Number Theory
flintlib.org·3h
🧮Algebraic Datatypes
How to Benchmark Classical Machine Learning Workloads on Google Cloud
towardsdatascience.com·28m
⚡Performance Mythology
Song recommendations with F# free monads
blog.ploeh.dk·14h
🔗Functional Compilers
Sets & Heaps in Haskell and Rust
mmhaskell.com·12h
🔒Type Safety
Knowledge and Common Knowledge in a Distributed Environment, Part 2
emptysqua.re·10h
🤝Paxos Consensus
Notes on Autograd
aschrein.github.io·2h·
Discuss: Hacker News
⚡Incremental Computation
Teaching programming languages
kmjn.org·9h
💻Programming languages
Formal verification effort for the ABDK Math 64.64 library using echidna/hevm
github.com·7h·
Discuss: Hacker News
✅Format Verification
Bmssp: A New Shortest Path Algorithm
rohanparanjpe.substack.com·3h·
Discuss: Substack
🔗Topological Sorting
It takes 26 yottabytes of RAM to typecheck a union of Safe Integers
playfulprogramming.com·21h
🧪Binary Fuzzing
Sound and Solution-Complete CCBS
arxiv.org·17h
🛡️Archive Verification
Deep Think with Confidence
arxiviq.substack.com·1d·
Discuss: Substack
💻Local LLMs
Why a simple for loop (brute-force k-NN) becomes computationally impossible for modern AI applications
dev.to·12h·
Discuss: DEV
🧮Kolmogorov Complexity
Memory optimizations to reduce CPU costs
ayende.com·10h·
Discuss: Hacker News
📝Text Compression
Relacy Race Detector is a verifier for relaxed memory models
1024cores.net·7h·
Discuss: Hacker News
⚡Hardware Transactional Memory
OpenAI: Building the "Everything Platform" in AI
leoniscap.com·2h·
Discuss: Hacker News
🤖AI Curation
busy beaver function
ncatlab.org·2d
⚔️Lean Theorem
Can large language models figure out the real world?
news.mit.edu·58m
🧮Kolmogorov Bounds